The Nonstationary Loss Queue: a Survey

نویسندگان

  • KHALID ABDULAZIZ ALNOWIBET
  • HARRY PERROS
چکیده

The nonstationary loss queue is of great interest since the arrival rate in most communication systems varies over time. In view of the difficulty in solving the nonstationary loss queue, various approximation methods have been developed. In this paper, we review several of these approximation methods and present a new technique, the fixed point approximation (FPA) method. Numerical evidence points to the fact that the FPA method gives the exact solution.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonstationary Erlang Loss Queues and Networks

ALNOWIBET, KHALID ABDULAZIZ Nonstationary Erlang Loss Queues and Networks. (Under the direction of Dr. Harry Perros) The nonstationary Erlang loss model is a queueing system consisting of a finite number of servers and no waiting room with a nonstationary arrival process or a time-dependent service rate. The Erlang loss model is commonly used to model and evaluate many communication systems. Of...

متن کامل

Nonstationary analysis of the loss queue and of queueing networks of loss queues

We present an iterative scheme based on the fixed point approximation method, for the numerical calculation of the time-dependent mean number of customers and blocking probability functions in a nonstationary queueing network with multi-rate loss queues. We first show how the proposed method can be used to analyze a single-class, multiclass, and multi-rate nonstationary loss queue. Subsequently...

متن کامل

Unreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service

This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...

متن کامل

The Dynamic Analysis and Design of A Communication link with Stationary and Nonstationary Arrivals

Most research in queueing theory is typically based on the steady-state analysis. In today’s dynamically changing traffic environment, the steady-state analysis may not provide enough information to operators regarding Quality of Service (QoS) requirements and dynamic design. In addition, the steady state analysis is not practical for nonstationary arrivals. In this paper, we consider the time-...

متن کامل

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005